北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (6): 9-13.doi: 10.13190/jbupt.200906.9.yangm

• 论文 • 上一篇    下一篇

基于加权平均的网格资源分配与定价

杨明;刘元安;马晓雷;李立   

  1. (北京邮电大学 电子工程学院, 北京 100876)
  • 收稿日期:2009-03-31 修回日期:2009-06-27 出版日期:2009-12-28 发布日期:2009-12-28
  • 通讯作者: 杨明

Grid Resource AllocationPricing Based on Weighted Average

YANG Ming;LIU Yuan-an;MA Xiao-lei;LI Li   

  1. (School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2009-03-31 Revised:2009-06-27 Online:2009-12-28 Published:2009-12-28
  • Contact: YANG Ming

摘要:

针对网格资源分配中现有组合双向拍卖模型以资源包平均价格定价的不足,提出以各类资源的单价定价的算法. 根据组合双向拍卖和网格信任理论,提出基于加权平均算法的网格资源分配与定价策略,以信任度阈值的加权平均鉴别恶意节点,以归一化报价和信任度的加权平均衡量正常节点的价格及信任综合竞争力. 仿真结果表明,该算法交易率较高,可防范恶意节点,交易效用可激励正常节点以提高其综合竞争力.

关键词: 网格, 资源分配, 定价, 组合双向拍卖, 信任, 效用

Abstract:

According to the deficiency of the mean price based pricing method in combinatorial double auction for grid resource allocation, a unit price based pricing algorithm is presented. Based on combinatorial double auction and grid trust theories, a weighted average algorithm based grid resource allocation and pricing strategy is proposed. This algorithm identifies malicious nodes through the weighted average of the trust degree thresholds, and assesses the comprehensive competitiveness of the normal nodes through the weighted average of normalized bid prices and trust degrees. Simulations show the algorithm represents high trade rate and can prevent malicious nodes from entering into the market. The trade utility can give nodes incentives to improve their competitiveness.

Key words: grid, resource allocation, pricing, combinatorial double auction, trust, utility